Complex-Valued Neural Network for Hermitian Matrices
نویسندگان
چکیده
This paper proposes neural network for computing the eigenvectors of Hermitian matrices. For the eigenvalues of Hermitian matrices, we establish an explicit representation for the solution of the neural network based on Hermitian matrices and analyze its convergence property. We also consider to compute the eigenvectors of skew-symmetric matrices and skew-Hermitian matrices, corresponding to the imaginary maximal or imaginary minimal eigenvalue, based on the neural network for computing the eigenvectors of Hermitian matrices. Numerical examples are given to illustrate our theoretical result are valid.
منابع مشابه
Almost-Hermitian Random Matrices: Eigenvalue Density in the Complex Plane
We consider an ensemble of large non-Hermitian random matrices of the form Ĥ + iÂs, where Ĥ and Âs are Hermitian statistically independent random N × N matrices. We demonstrate the existence of a new nontrivial regime of weak non-Hermiticity characterized by the condition that the average of NTrÂs is of the same order as that of TrĤ 2 when N → ∞. We find explicitly the density of complex eigenv...
متن کاملNew stability condition for discrete-time fully coupled neural networks with multivalued neurons
This paper discusses the stability condition for discrete-time multi-valued recurrent neural networks (MVNRNNs) in asynchronous update mode. In the existing research literature, an MVNRNN in asynchronous update mode has been found convergent if its weight matrix is Hermitian with nonnegative diagonal entries. However, our finding has been that the weight matrix with zero diagonal entries can’t ...
متن کاملEla Perturbations of Functions of Diagonalizable Matrices
Let f be a scalar function defined on σ(A) ∪ σ(Ã). The aim of this paper is to establish inequalities for the norm of f(A) − f(Ã). The literature on perturbations of matrix valued functions is very rich but mainly, perturbations of matrix functions of a complex argument and matrix functions of Hermitian matrices were considered, cf. [1, 11, 13, 14, 16, 18]. The matrix valued functions of a non-...
متن کاملOn the EXISTENCE OF HOPFIELD NEURAL NETWORKS: SYNTHESIS OF HOPFIELD TYPE ASSOCIATIVE MEMORIES:
In this research paper, the problem of existence of the associative memory synthesized by Hopfield is addressed and solved. Using Hadamard matrix of suitable dimension, an algorithm to synthesize real valued Hopfield neural network is discussed. The problem of existence and synthesis of a certain complex Hopfield neural network is addressed and solved. Also, synthesis of real and complex Hopfie...
متن کاملLecture 8 : Eigenvalues and Eigenvectors
Hermitian Matrices It is simpler to begin with matrices with complex numbers. Let x = a + ib, where a, b are real numbers, and i = √ −1. Then, x∗ = a− ib is the complex conjugate of x. In the discussion below, all matrices and numbers are complex-valued unless stated otherwise. Let M be an n× n square matrix with complex entries. Then, λ is an eigenvalue of M if there is a non-zero vector ~v su...
متن کامل